Unconstrained and Constrained Fault-Tolerant Resource Allocation

نویسندگان

  • Kewen Liao
  • Hong Shen
چکیده

First, we study the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem (a.k.a. FTFA problem in [19]). In the problem, we are given a set of sites equipped with an unconstrained number of facilities as resources, and a set of clients with setR as corresponding connection requirements, where every facility belonging to the same site has an identical opening (operating) cost and every client-facility pair has a connection cost. The objective is to allocate facilities from sites to satisfy R at a minimum total cost. Next, we introduce the Constrained FaultTolerant Resource Allocation (CFTRA) problem. It differs from UFTRA in that the number of resources available at each site i is limited by Ri. Both problems are practical extensions of the classical Fault-Tolerant Facility Location (FTFL) problem [10]. For instance, their solutions provide optimal resource allocation (w.r.t. enterprises) and leasing (w.r.t. clients) strategies for the contemporary cloud platforms. In this paper, we consider the metric version of the problems. For UFTRA with uniform R, we present a star-greedy algorithm. The algorithm achieves the approximation ratio of 1.5186 after combining with the cost scaling and greedy augmentation techniques similar to [3,14], which significantly improves the result of [19] using a phase-greedy algorithm. We also study the capacitated extension of UFTRA and give a factor of 2.89. For CFTRA with uniform R, we slightly modify the algorithm to achieve 1.5186-approximation. For a more general version of CFTRA, we show that it is reducible to FTFL using linear programming.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constrained Fault-Tolerant Resource Allocation

We follow [18,25] and give a series of improved results for the Constrained Fault-Tolerant Resource Allocation (FTRA) problem. In FTRA, we are given a set of sites containing facilities as resources, and a set of clients consuming these resources. Specifically, each site i is allowed to open at most Ri facilities with cost fi for each opened facility. Each client j requires an allocation of rj ...

متن کامل

A Budget and Deadline Constrained Fault Tolerant Load Balanced Scheduling Algorithm for Computational Grids

Grid is an environment with millions of resources which are dynamic and heterogeneous in nature. A computational grid is one in which the resources are computing nodes and is meant for applications that involves larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Resource allocation is a tedi...

متن کامل

An Operational Approach to Budget-constrained Reliability Allocation

In this paper the problem of maximal increase of system reliability is formulated as a resource allocation problem under a budget constraint. Dynamic programing is used for the optimal solution. Time to system failure is dictated by a Markov process. The system is composed of several subsystems. Each subsystem has several possible configurations that exhibit different levels of fault tolerance ...

متن کامل

Synthesis of fault-tolerant feedforward neural networks using minimax optimization

In this paper we examine a technique by which fault tolerance can be embedded into a feedforward network leading to a network tolerant to the loss of a node and its associated weights. The fault tolerance problem for a feedforward network is formulated as a constrained minimax optimization problem. Two different methods are used to solve it. In the first method, the constrained minimax optimiza...

متن کامل

A Multiconstrained Grid Scheduling Algorithm with Load Balancing and Fault Tolerance

Grid environment consists of millions of dynamic and heterogeneous resources. A grid environment which deals with computing resources is computational grid and is meant for applications that involve larger computations. A scheduling algorithm is said to be efficient if and only if it performs better resource allocation even in case of resource failure. Allocation of resources is a tedious issue...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011